Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs
نویسندگان
چکیده
منابع مشابه
Average consensus with weighting matrix design for quantized communication on directed switching graphs
We study average consensus for directed graphs with quantized communication under fixed and switching topologies. In the presence of quantization errors, conventional consensus algorithms fail to converge and may suffer from an unbounded asymptotic mean square error. We develop robust consensus algorithms to reduce the effect of quantization. Specifically, we introduce a robust weighting matrix...
متن کاملDynamic consensus estimation of weighted average on directed graphs
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملMatrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs
This paper presents a proof of correctness of an iterative approximate Byzantine consensus (IABC) algorithm for directed graphs. The iterative algorithm allows faultfree nodes to reach approximate conensus despite the presence of up to f Byzantine faults. Necessary conditions on the underlying network graph for the existence of a correct IABC algorithm were shown in our recent work [15, 16]. [1...
متن کاملMax-Balancing Weighted Directed Graphs and Matrix Scaling
A weighted directed graph G IS a triple (V, A . g) where (V. A) IS a directed graph and g is a n arbitrary real-valued function defined on the arc set A. Let G be a strongly-connected, simple weighted directed graph. We say tha t G is max-balanced if fo r every nontrivial ~ ubset of the vertices W, the maxImum weight over arcs leaving W equals the maximum weIght over arcs entering W. We show th...
متن کاملByzantine Consensus in Directed Graphs∗
Consider a synchronous point-to-point network of n nodes connected by directed links, wherein each node has a binary input. This paper proves a tight necessary and sufficient condition for achieving Byzantine consensus among these nodes in the presence of up to f Byzantine faults. We derive two forms of the necessary condition. We provide a constructive proof of sufficiency by presenting a Byza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2013
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2012.2219953